Gluing of graph Laplacians and their spectra
نویسندگان
چکیده
منابع مشابه
Gluing formulas for determinants of Dolbeault laplacians on Riemann surfaces
We present gluing formulas for zeta regularized determinants of Dolbeault laplacians on Riemann surfaces. These are expressed in terms of determinants of associated operators on surfaces with boundary satisfying local elliptic boundary conditions. The conditions are defined using the additional structure of a framing, or trivialization of the bundle near the boundary. An application to the comp...
متن کاملGraph Laplacians and their Convergence on Random Neighborhood Graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in several machine learning methods like semi-supervised learning, dimensionality reduction and clustering. In this paper we determine the pointwise limit of three d...
متن کاملDuality and nonlinear graph Laplacians
We present an iterative algorithm for solving a class of nonlinear Laplacian system of equations in Õ(km log(kn/ǫ)) iterations, where k is a measure of nonlinearity, n is the number of variables, m is the number of nonzero entries in the graph Laplacian L, ǫ is the solution accuracy and Õ() neglects (non-leading) logarithmic terms. This algorithm is a natural nonlinear extension of the one by o...
متن کاملKernels of Directed Graph Laplacians
Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D − Q, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when G is undirected, the multiplicity of the eigenvalue 0 equals the number of connected components of G. This fact has a meaningful generalization to directed graphs, as was observ...
متن کاملEigenvalues of Transmission Graph Laplacians
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a “transmission” system. A transmission system is a mathematical representation of a means of transmitting (multi-parameter) data along directed edges from vertex to vertex. The associated transmission graph Laplacian is shown to have many of the former properties of the classica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear and Multilinear Algebra
سال: 2018
ISSN: 0308-1087,1563-5139
DOI: 10.1080/03081087.2018.1516727